Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph
نویسندگان
چکیده
In this paper we discuss a method for bounding the size of the stabiliser of a vertex in a G-vertex-transitive graph Γ. In the main result the group G is quasiprimitive or biquasiprimitive on the vertices of Γ, and we obtain a genuine reduction to the case where G is a nonabelian simple group. Using normal quotient techniques developed by the first author, the main theorem applies to general G-vertex-transitive graphs which areG-locally primitive (respectively, G-locally quasiprimitive), that is, the stabiliser Gα of a vertex α acts primitively (respectively quasiprimitively) on the set of vertices adjacent to α. We discuss how our results may be used to investigate conjectures by Richard Weiss (in 1978) and the first author (in 1998) that the order of Gα is bounded above by some function depending only on the valency of Γ, when Γ is G-locally primitive or G-locally quasiprimitive, respectively. To Richard Weiss for the inspiration of his beautiful conjecture
منابع مشابه
Bounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملA proof of the polycirculant conjecture
This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive graphs as coset graphs. For a coset graph H, an equivalence relation ∼ is defined on the vertices of cosets with classes as double cosets of the stabiliser and a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 102 شماره
صفحات -
تاریخ انتشار 2012